On a problem concerning the Smarandache friendly prime pairs

نویسنده

  • Felice Russo
چکیده

In this paper a question posed in [1 J and concerning the Smarandache friendly prime pairs is analysed. Introduction In [1] the Smarandache friendly prime pairs are defmed as those prime pairs (p,q) such that:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a problem concerning the Smarandache Unary sequence

In this paper a problem posed in [1J and concerning the number of primes in the Smarandache Unary sequence is analysed. Introduction In [1] the Smarandache Unary sequence is defined as the sequence obtained concatenating Pn digits of 1, where Pn is the n-th prime number: 11,111,11111,1111111,11111111111,1111111111111,11111111111111111, ......... . In the same paper the following open question i...

متن کامل

The Smarandache Friendly Natural Number Pairs

In this paper we completely determinate all the Smarandache friendly natural number pairs.

متن کامل

On a Smarandache problem concerning the prime gaps

In this paper, a problem posed in [1] by Smarandache concerning the prime gaps is analyzed. Let's n p be the n-th prime number and n d the following ratio: 2 p p d n 1 n n − = + where 1 ≥ n If we indicate with n n n p p g − = +1 the gap between two consecutive primes, the previous equation becomes: 2 n n g d = In [1], Smarandache posed the following questions: 1. Does the sequence n d contain i...

متن کامل

On three problems concerning the Smarandache LCM sequence

In this paper three problems posed in [1J and concerning the Smarandache LeM sequence have been analysed. Introduction In [1] the Smarandache LCM . sequence is defined as the least common mUltiple (LCM) of (1,2,3, .,. ,n) : 1,2,6, 12,60,60,420,840,2520,2520,27720,27720,360360, 360360, 360360, 720720 ...... . In the same paper the following three problems are reported: 1. If a(n) is the n-th ter...

متن کامل

Javaconcurentprogramforthesamarandacbe Function

The aim of this article is to propose a Java concurrent program for the Smarandache fimction based on the equation sept' ..... p:.) = max{s(p~' ), ... ,S(p:·)}. Some results concerning the theoretical complexity of this program are proposed. Fmally, the experimental results of the sequential and Java programs are given in order to demonstrate the efficiency of the conament implementation. 1. IN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001